A Brief History of NP - Completeness , 1954 – 2012
نویسنده
چکیده
The year 2012 marks the 40th anniversary of the publication of the influential paper “Reducibility among combinatorial problems” by Richard Karp [37]. This paper was the first to demonstrate the wide applicability of the concept now known as NP-completeness, which had been introduced the previous year by Stephen Cook and Leonid Levin, independently. 2012 also marks the 100th anniversary of the birth of Alan Turing, whose invention of what is now known as the “Turing machine” underlay that concept. In this chapter, I shall briefly sketch the history and pre-history of NP-completeness (with pictures), and provide a brief personal survey of the developments in the theory over the last 40 years and their impact (or lack thereof) on the practice and theory of optimization. I assume the reader is familiar with the basic concepts of NP-completeness, P, and NP, although I hope the story will still be interesting to those with only a fuzzy recollection of the definitions.1
منابع مشابه
Basics of Steiner Minium Trees
These notes give a brief introduction to the NP-completeness of the Steiner problem for graphs.
متن کاملSatisfiability: where Theory meets Practice∗
Propositional Satisfiability (SAT) is a keystone in the history of computer science. SAT was the first problem shown to be NP-complete in 1971 by Stephen Cook [4]. Having passed more than 40 years from then, SAT is now a lively research field where theory and practice have a natural intermixing. In this talk, we overview the use of SAT in practical domains, where SAT is thought in a broad sense...
متن کاملThe Euclidean Steiner Tree Problem
The Euclidean Steiner tree problem is solved by finding the tree with minimal Euclidean length spanning a set of fixed vertices in the plane, while allowing for the addition of auxiliary vertices (Steiner vertices). Steiner trees are widely used to design real-world structures like highways and oil pipelines. Unfortunately, the Euclidean Steiner Tree Problem has shown to be NP-Hard, meaning the...
متن کاملFinding a Hamiltonian Path in a Cube with Specified Turns is Hard Citation
We prove the NP-completeness of finding a Hamiltonian path in an N ×N ×N cube graph with turns exactly at specified lengths along the path. This result establishes NP-completeness of Snake Cube puzzles: folding a chain of N unit cubes, joined at face centers (usually by a cord passing through all the cubes), into an N ×N ×N cube. Along the way, we prove a universality result that zig-zag chains...
متن کاملMicroemulsions – A Brief Introduction
Nevertheless, the existence and application history of the microemulsions goes back to the very older times, but the oldest available reports in this field have been published by Schulman (Schulman & Hoar, 1943) and Winsor (Winsor, 1954). Their works are the starting point of efforts for the systematic understanding of the microemulsions. Meanwhile, the widespread generalization and application...
متن کامل